package com.leetcode.partition6;

/**
 * @author `RKC`
 * @date 2021/11/7 9:05
 */
public class LC598范围求和2 {

    public static int maxCount(int m, int n, int[][] ops) {
        int x = m, y = n;
        for (int[] op : ops) {
            x = Math.min(x, op[0]);
            y = Math.min(y, op[1]);
        }
        return x * y;
    }
}
